Pheromone Modification Strategies for Ant Algorithms Applied to Dynamic TSP
نویسندگان
چکیده
منابع مشابه
Evolving Strategies for Updating Pheromone Trails: A Case Study with the TSP
Ant Colony Optimization is a bio-inspired technique that can be applied to solve hard optimization problems. A key issue is how to design the communication mechanism between ants that allows them to effectively solve a problem. We propose a novel approach to this issue by evolving the current pheromone trail update methods. Results obtained with the TSP show that the evolved strategies perform ...
متن کاملOptimizing the Ant Colony Optimization Algorithm Using Neural Network for the Traveling Salesman Problem
Ant Colony Optimization (ACO) has been proved to be one of the most effective algorithms to solve a wide range of combinatorial optimization (or NP-hard) problems as the Travelling Salesman Problem (TSP). The first step of an ACO algorithm is setting the parameters that drive the algorithm. The basic parameters that are used in ACS algorithms are; number of ants, the relative importance (or wei...
متن کامل1 ACO Algorithms for the Traveling Salesman Problem
Ant algorithms [18, 14, 19] are a recently developed, population-based approach which has been successfully applied to several NP-hard combinatorial optimization problems [6, 13, 17, 23, 34, 40, 49]. As the name suggests, ant algorithms have been inspired by the behavior of real ant colonies, in particular, by their foraging behavior. One of the main ideas of ant algorithms is the indirect comm...
متن کاملInvestigating the Application of Opposition-Based Ideas to Ant Algorithms
Opposition-based learning (OBL) was recently proposed to extend different machine learning algorithms. The main idea of OBL is to consider opposite estimates, actions or states as an attempt to increase the coverage of the solution space and to reduce exploration time. OBL has already been applied to reinforcement learning, neural networks and genetic algorithms. This thesis explores the applic...
متن کاملStrategies DACS3 Increasing its Performances
Ant Colony System (ACS) is the most popular algorithm used to find a shortest path solution in Traveling Salesman Problem (TSP). Several ACS versions have been proposed which aim to achieve an optimum solution by adjusting pheromone levels. Embedding Malaysian House Red Ant behavior into ACS known as Dynamic Ant Colony Systems with Three Level Updates (DACS3) has increased the ability to reach ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2001